A Simple Interpretation of OOP in a Language with State

Giving a complete semantics to strongly typed object-oriented programming is a well-known research problem. Recent work has made signiicant strides toward solving this problem. However , in most of this work a purely functional, call-by-name view of objects is taken. In this paper we give meaning to a call-by-value, typed object language with updatable instance variables , and prove the type system given is sound; i.e., well-typed programs do not experience \message not understood" errors. The semantics is given by a translation of the object-based language into a state-based language with a simple type discipline and with a new notion of a once-assignable cell.